Dynamic Multi-Objective Auction-Based (DYMO-Auction) Task Allocation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Auction-Based Task Allocation for Multi-robot Teams in Dynamic Environments

There has been much research on the use of auction-based methods to provide a distributed approach to task allocation for robot teams. Team members bid on tasks based on their locations, and the allocation is based on these bids. The focus of prior work has been on the optimality of the allocation, establishing that auction-based methods perform well in comparison with optimal allocation method...

متن کامل

Multi-Robot Task Allocation Strategies Using Auction-Like Mechanisms

Task allocation is a complex and open problem for multi-robot systems. In this paper, we present three strategies for dynamically allocating tasks in a colony of mobile robots. The system is partially inspired on auction and thresholds-based methods and tries to determine the optimum number of robots that are needed to solve specific tasks, or sub-goals, in order to minimize the execution time ...

متن کامل

Auction-based resource allocation in OpenFlow multi-tenant networks

In this paper, we investigate the allocation of network resources (such as Flow Table entries and bandwidth) in multitenant Software-Defined Networks (SDNs) that are managed by a FlowVisor. This resource allocation problem is modeled as an auction where the FlowVisor acts as the auctioneer and the network Controllers act as the bidders. The problem is analyzed by means of non-cooperative game t...

متن کامل

Multi-dimensional fairness for auction-based resource allocation

Multi-attribute resource allocation problems involves the allocation of resources on the basis of several attributes, therefore, the definition of a fairness method for this kind of auctions should be formulated from a multidimensional perspective. Under such point of view, fairness should take into account all the attributes involved in the allocation problem, since focusing in just a single a...

متن کامل

Auction-Based Dynamic Task Allocation for Foraging with a Cooperative Robot Team

Many application domains require search and retrieval, which is also known in the robotic domain as foraging. An example domain is search and rescue where a disaster area needs to be explored and transportation of survivors to a safe area needs to be arranged. Performing these tasks by more than one robot increases performance if tasks are allocated and executed efficiently. In this paper, we s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Sciences

سال: 2020

ISSN: 2076-3417

DOI: 10.3390/app10093264